Reviews basic data structures. Covers the mechanics and relative efficiencies of advanced data structures. Students will implement several data structures such as AVL trees, heaps, hash tables, and adjacency lists. Discusses abstract data types such as maps, priority queues, and graphs. Introduction to algorithm analysis, sorting algorithms, and graph algorithms.

Provides the opportunity to apply academic experience in settings associated with future professional employment. A written proposal for the internship must be approved by the instructor. The proposal must specify what the student will learn from the internship, why the student is properly prepared for the internship and what supervision is available during the internship. A mid-semester report and final report are required. Prereq: permission.

Explores the main features of modern, high-level, general-purpose programming languages from the user (programmer) standpoint. Students learn how specific features of programming languages can be used effectively in solving programming problems. The course is also an opportunity to use paradigms that expand on simple imperative programming, such as object-oriented, functional and concurrent programming. Students are expected to have background in operating systems fundamentals and Computer organization, and some knowledge of Java.

This course examines the historic, theoretical, and applied foundations of community development lending and investment. The course critically examines what works, what doesn't work, and how community development financial institutions, investors, government agencies, private donors, and the capital markets have all contributed to the field of community development finance. The course also covers which methodologies, strategies, products, services, organizational models, and evaluation and reporting protocols have the greatest efficacy towards building and improving the industry.